منابع مشابه
Domain Decomposition Operator Splittings for the Solution of Parabolic Equations
We study domain decomposition counterparts of the classical alternating direction implicit (ADI) and fractional step (FS) methods for solving the large linear systems arising from the implicit time stepping of parabolic equations. In the classical ADI and FS methods for parabolic equations, the elliptic operator is split along coordinate axes; they yield tridiagonal linear systems whenever a un...
متن کاملAdditive domain decomposition operator splittings – convergence analyses in a dissipative framework
We analyze temporal approximation schemes based on overlapping domain decompositions. As such schemes enable computations on parallel and distributed hardware, they are commonly used when integrating large-scale parabolic systems. Our analysis is conducted by first casting the domain decomposition procedure into a variational framework based on weighted Sobolev spaces. The time integration of a...
متن کاملBalancing Domain Decomposition
The Neumann-Neumann algorithm is known to be an e cient domain decomposition preconditioner with unstructured subdomains for iterative solution of nite element discretizations of di cult problems with strongly discontinuous coe cients [6]. However, this algorithm su ers from the need to solve in each iteration an inconsistent singular problem for every subdomain, and its convergence deteriorate...
متن کاملOverlapping Domain Decomposition Methods
Overlapping domain decomposition methods are efficient and flexible. It is also important that such methods are inherently suitable for parallel computing. In this chapter, we will first explain the mathematical formulation and algorithmic composition of the overlapping domain decomposition methods. Afterwards, we will focus on a generic implementation framework and its applications within Diff...
متن کاملHeuristics for Domain Decomposition
The domain decomposition method embodies large potentials for a parallelization of FEM methods. In this data-parallel approach, the domain of interest is partitioned into smaller subdomains, either before the mesh generation or afterwards (mesh partitioning). The subdomains are assigned to processors that calculate the corresponding part of the approximation. The mesh decomposition and assignme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2000
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(00)00016-1